CORC Technical Report TR-2002-03 Robust portfolio selection problems
نویسندگان
چکیده
In this paper we show how to formulate and solve robust portfolio selection problems. The objective of these robust formulations is to systematically combat the sensitivity of the optimal portfolio to statistical and modeling errors in the estimates of the relevant market parameters. We introduce “uncertainty structures” for the market parameters and show that the robust portfolio selection problems corresponding to these uncertainty structures can be reformulated as second-order cone programs and, therefore, the computational effort required to solve them is comparable to that required for solving convex quadratic programs. Moreover, we show that these uncertainty structures correspond to confidence regions associated with the statistical procedures employed to estimate the market parameters. Finally, we demonstrate a simple recipe for efficiently computing robust portfolios given raw market data and a desired level of confidence.
منابع مشابه
CORC Technical Report TR - 2004 - 11 Robust Active Portfolio Management ∗
In this paper we construct robust models for active portfolio management in a market with transaction costs. The goal of these robust models is to control the impact of estimation errors in the values of the market parameters on the performance of the portfolio strategy. Our models can handle a large class of piecewise convex transaction cost functions and allow one to impose additional side co...
متن کاملCORC Technical Report TR-2004-11 Robust Portfolio Management
In this paper we present robust models for index tracking and active portfolio management. The goal of these models is to control the effect of statistical errors in estimating market parameters on the performance of the portfolio. The proposed models allow one to impose additional side constraints such as bounds on the portfolio holdings, constraints on the portfolio beta, limits on cash expos...
متن کاملCORC Technical Report TR-2003-02 Inverse conic programming and applications
The past decade has seen a growing interest in inverse optimization. It has been shown that duality yields very efficient algorithms for solving inverse linear programming problems. In this paper, we consider a special class of conic programs that admits a similar duality and show that the corresponding inverse optimization problems are efficiently solvable. We discuss the applications of inver...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملCorc Technical Report Tr-2004-03 Using Geometry and Iterated Refinement for Inverse Problems (1): Total Variation Based Image Restoration
We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods, specifically by using the BV seminorm. Although our procedure applies in quite general situations it was obtained by geometric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002